Research on Component Assignment Problem Based on the BIQGA
نویسندگان
چکیده
Component assignment problem (CAP) is critical for the research on system reliability, which was firstly put forward by Derman [1]. Many scholars have performed comprehensive studies on CAP with different algorithms. Since importance measure can find the weakness of the system, the highest reliable components are probably assigned into most important position to optimize the system reliability. By analyzing the error terms, Lin and Kuo [2] established a LK algorithm for lin/con/k/n system optimization, which can assign components one by one into the system based on the Birnbaum Importance value. According to the characteristics of Genetic algorithm (GA), GA can break through the limit of local optimal solution and find the global optimal or approximate optimal solution in a large scaled search space. And the concurrency of quantum computing can improve the computing speed largely. With the rapid development of computer technology, combining importance measure with quantum computing and GA is meaningful to improve the efficiency and accuracy for CAP. In this paper, we thus introduce a Birnbaum importance based quantum genetic algorithm (BIQGA) to solve the CAP. And then the performance of the BIQGA and general quantum genetic algorithm (QGA) is compared.
منابع مشابه
A New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملAn Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach
One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملA New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015